Drawing the Horton set in an integer grid of minimum size
نویسندگان
چکیده
منابع مشابه
Drawing the Horton Set in an Integer Grid of Minimun Size
In 1978 Erdős asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex k-gon, with the additional property that no other point of the set lies in its interior. Shortly after, Horton provided a construction—which is now called the Horton set—with no such 7-gon. In this paper we show that the Horton set of n points can be realized with int...
متن کاملDrawing the almost convex set in an integer grid of minimum size
In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems. In this paper we refer to these sets as nested almost convex sets. A nested almost convex set X has the property that the interior of every triangle determined by three points in the same convex layer of X , contains ...
متن کاملDrawing the double circle on a grid of minimum size
In 1926, Jarńık introduced the problem of drawing a convex ngon with vertices having integer coordinates. He constructed such a drawing in the grid [1, c · n] for some constant c > 0, and showed that this grid size is optimal up to a constant factor. We consider the analogous problem for drawing the double circle, and prove that it can be done within the same grid size. Moreover, we give an O(n...
متن کاملDrawing High-degree Graphs with Small Grid-size Drawing High-degree Graphs with Small Grid-size
In this paper, we present a general scheme to produce interactive and static orthogonal drawings of graphs. As opposed to most known algorithms, we do not restrict ourselves to graph with maximum degree 4, but allow arbitrary degrees. We show here how, with one speciic implementation of the scheme, we can obtain an m+n 2 m+n 2-grid for all simple connected graphs without nodes of degree 1. Furt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.02.002